Occurrences in Debugger Speciications
نویسنده
چکیده
We describe formal manipulations of programming language semantics that permit execution animation for interpreters. We rst study the use of occurrences in the-calculus and we describe an implementation of the notion of residuals. We then describe applications in the development of interpreters for the lazy-calculus and the parallel language Oc-cam.
منابع مشابه
An Experiment in Applying Ontologies to Augment and Reason about the Correctness of Speciications
In this paper we investigate how software speciications can beneet from the presence of formal ontologies to augment and enrich their context. This makes it possible to verify the correct-ness of the speciication with respect to formally represented domain knowledge. We present a meta-interpretation technique that allows us to perform checks for conceptual error occurrences in speciications. We...
متن کاملModular Speciications with Supernormal Defaults ?
We add a simple module system to speciications with super-normal defaults. It allows to distinguish between \deening" and \calling" occurrences of predicates. This greatly improves the understandability of large default speciications and especially helps to solve the problem of unwanted contrapositions of rules. Our approach is similar to the distinction between head and body of logic programmi...
متن کاملUsing parametric set constraints for locating errors in CLP programs
This paper introduces a framework of parametric descriptive directional types for constraint logic programming (CLP). It proposes a method for locating type errors in CLP programs and presents a prototype debugging tool. The main technique used is checking correctness of programs w.r.t. type speciications. The approach is based on a generalization of known methods for proving correctness of log...
متن کاملRuntimeSearch: Ctrl+F for a running program
Developers often try to find occurrences of a certain term in a software system. Traditionally, a text search is limited to static source code files. In this paper, we introduce a simple approach, RuntimeSearch, where the given term is searched in the values of all string expressions in a running program. When a match is found, the program is paused and its runtime properties can be explored wi...
متن کاملParametric Quantitative Temporal Reasoning
We deene Parameterized Real-Time Computation Tree Logic (PRTCTL), which allows quantitative temporal speciications to be parameterized over the natural numbers. Parameterized quantitative speciications are quantitative speciications in which concrete timing information has been abstracted away. Such abstraction allows designers to specify quantitative restrictions on the temporal ordering of ev...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1991